Culprit Detection on Incremental Tractable Qualitative Temporal Reasoning Problems
نویسندگان
چکیده
......................................................................................... iii List of Figures ........................................................................................ vii Acknowledgement ....................................................................................ix Dedication ............................................................................................x Chapter 1 – Introduction..........................................................................1 1.1 – Problem overview...................................................................1 1.2 – Thesis organization.................................................................1 1.3 – Contribution ...........................................................................2 1.4 – Publications ............................................................................3 Chapter 2 – Background...........................................................................4 2.1 – Temporal reasoning ................................................................4 2.1.1 Point Reasoning ..........................................................4 2.1.2 Interval Reasoning ......................................................5 2.2 – Incremental Temporal Reasoning..........................................10 2.3 – Incremental Complexity issues .............................................11 2.4 – Problem Complexity .............................................................15 v 2.4.1 Point reasoning complexity .......................................15 2.4.2 Interval reasoning complexity ...................................15 Chapter 3 – Problem Establishment ......................................................16 3.1 – Disjunctive Normal Form .....................................................16 3.2 – Conjunctive Normal Form ....................................................16 3.2 – Culprit detection in the point algebra ....................................17 3.2.1 – The FindMinSet Algorithm ....................................20 3.2.2 – A Tractable problem...............................................23 3.2.3 – Implementation ......................................................34 3.3 – Culprit detection in the Interval Problem...............................36 3.3.1 – Reasoning on the whole algebra is NP-Hard ...........36 Chapter 4 – ORD-Horn algebra .............................................................38 4.1 – Definition .............................................................................38 4.2 – Literature..............................................................................39 4.3 – Decomposition into a point algebra problem .........................43 4.3.1 – Positive model........................................................43 4.3.2 – Negative model ......................................................46 4.4 – Algorithms............................................................................48 4.4.1 – Normalization Algorithm .......................................48 4.4.2 – Sorter Algorithm ....................................................55
منابع مشابه
Incremental Tractable Reasoning about Qualitative Temporal Constraints
In many applications of temporal reasoning we are in terested in reasoning incrementally In particular, given a CSP of temporal constrains and a new constraint, we want to maintain certain properties in the extended CSP (e.g., a solution), rather than recomputing them from scratch. The Point Algebra (PA) and the Interval Algebra (IA) are two well-known frameworks for qualitative tem poral rea...
متن کاملOn-line Qualitative Temporal Reasoning with Explanation
This work is a confluence of three problems in constraint reasoning: qualitative temporal reasoning (QTR), incremental reasoning, and explanation generation. Our primary objective is to detect the cause of inconsistency in an incremental version of the QTR problem.
متن کاملOn the Complexity of Qualitative Spatial Reasoning: A Maximal Tractable Fragment of the Region Connection
The computational properties of qualitative spatial reasoning have been investigated to some degree. However, the question for the boundary between polynomial and NP-hard reasoning problems has not been addressed yet. In this paper we explore this boundary in the \Region Connection Calculus" RCC-8. We extend Bennett's encoding of RCC-8 in modal logic. Based on this encoding, we prove that reaso...
متن کاملOn the Complexity of Qualitative Spatial Reasoning : A Maximal Tractable Fragment of RCC-8
The computational properties of qualitative spatial reasoning have been investigated to some degree . However, the question for the boundary between polynomial and NP-hard reasoning problems has not been addressed yet . In this paper we explore this boundary in the "Region Connection Calculus" RCC-8. We extend Bennett's encoding of RCC-8 in modal logic. Based on this encoding, we prove that rea...
متن کاملQualitative Spatial and Temporal Reasoning: Efficient Algorithms for Everyone
In the past years a lot of research effort has been put into finding tractable subsets of spatial and temporal calculi. It has been shown empirically that large tractable subsets of these calculi not only provide efficient algorithms for reasoning problems that can be expressedwith relations contained in the tractable subsets, but also surprisingly efficient solutions to the general, NP-hard re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006